Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil
نویسندگان
چکیده
We describe a protocol called ‘Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil’ (in short, Hot-Stuff) for n = 3f+1 replicas, of which 2f+1 are honest, to agree on a replicated, ever-changing state. The protocol is always safe against a threshold f of Byzantine failures, even when the system is asynchronous. Progress is guaranteed under periods of synchrony. The per-round communication cost in Hot-Stuff is linear, hence O(n) overall cost to a decision during periods of synchrony, an improvement of O(n) over previous asynchronous BFT protocols. Hot-Stuff uses one type of message exchange, and is succinctly described in under twenty lines of pseudo-code.
منابع مشابه
HQ Replication: Properties and Optimizations
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas to agree on a proposed ordering of requests, and a quorum-based approach, such as Q/U, in which clients contact replicas directly to optimistically execute operations. Both approaches have shortcomings: the quadratic co...
متن کاملPhD Thesis: BYZANTINE FAULT TOLERANCE: FROM STATIC SELECTION TO DYNAMIC SWITCHING
Byzantine Fault Tolerance (BFT) is becoming crucial with the revolution of online applications and due to the increasing number of innovations in computer technologies. Although dozens of BFT protocols have been introduced in the previous decade, their adoption by practitioners sounds disappointing. To some extant, this indicates that existing protocols are, perhaps, not yet too convincing or s...
متن کاملByzantine Fault Tolerance: From Static Selection To Dynamic Switching. (Byzantine Fault Tolerance: From Static Selection To Dynamic Switching)
Byzantine Fault Tolerance (BFT) is becoming crucial with the revolution of online applications and due to the increasing number of innovations in computer technologies. Although dozens of BFT protocols have been introduced in the previous decade, their adoption by practitioners sounds disappointing. To some extant, this indicates that existing protocols are, perhaps, not yet too convincing or s...
متن کاملDynamic Distributed Computing with Byzantine Failures
Byzantine failure tolerance (BFT) is one of the most fundamental problem in distributed computing and has been researched extensively. However, due to the famous impossible result of FLP, there is no perfect way to solve it. Modern BFT protocols are usually proposed with practical assumptions such as partially synchrony, encrypted messages. Yet, designing dynamic BFT system with large number of...
متن کاملImproving the resilience of active distribution networks by optimal charging/discharging management of electric vehicles in parking lots
In the event of a severe incident with a high impact and low probability of occurrence, distribution networks may be separated from upstream networks and several feeders may be disconnected simultaneously within the distribution networks. In such circumstances, to maximize the resilience of the distribution networks and to prevent long-term global outages, they are reconfigured and islanded to ...
متن کامل